Overlapping Domain Decomposition Algorithms for General Sparse Matrices
نویسندگان
چکیده
Domain decomposition methods for Finite Element problems using a partition based on the underlying nite element mesh have been extensively studied In this paper we discuss algebraic extensions of the class of overlapping domain decomposition algorithms for general sparse matrices The subproblems are created with an overlapping partition of the graph corresponding to the sparsity structure of the matrix These algebraic domain decomposition methods are especially useful for unstructured mesh problems We also discuss some di culties encountered in the algebraic extension particularly the issues related to the coarse solver
منابع مشابه
Data Structures and Algorithms for Domain Decomposition and Distributed Sparse Matrices
Although Domain Decomposition (DD) techniques constitute an important class of methods few actual general purpose codes based on these techniques have been developed so far. It is important to develop algorithms as well as software libraries and tools to facilitate parallel implementations of such techniques. In this paper we explore these ideas and propose a data structure for implementing`dis...
متن کاملA New Method for Speech Enhancement Based on Incoherent Model Learning in Wavelet Transform Domain
Quality of speech signal significantly reduces in the presence of environmental noise signals and leads to the imperfect performance of hearing aid devices, automatic speech recognition systems, and mobile phones. In this paper, the single channel speech enhancement of the corrupted signals by the additive noise signals is considered. A dictionary-based algorithm is proposed to train the speech...
متن کاملNonlinear Overlapping Domain Decomposition Methods
We discuss some overlapping domain decomposition algorithms for solving sparse nonlinear system of equations arising from the discretization of partial differential equations. All algorithms are derived using the three basic algorithms: Newton for local or global nonlinear systems, Krylov for the linear Jacobian system inside Newton, and Schwarz for linear and/or nonlinear preconditioning. The ...
متن کاملDirect linear time solvers for sparse matrices
In the last couple of years it has been realized that Gaussian elimination for sparse matrices arising from certain elliptic PDEs can be done in O(n log(1/ )) flops, where n is the number of unknowns and is a user-specified tolerance [Chandrasekaran and Gu]. The resulting solver will also be backward stable with an error of O( ). The techniques used to achieve this speedup has some commonality ...
متن کاملLocal Exponential Methods: a domain decomposition approach to exponential time integration of PDEs
A local approach to the time integration of PDEs by exponential methods is proposed, motivated by theoretical estimates by A.Iserles on the decay of off-diagonal terms in the exponentials of sparse matrices. An overlapping domain decomposition technique is outlined, that allows to replace the computation of a global exponential matrix by a number of independent and easily parallelizable local p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 3 شماره
صفحات -
تاریخ انتشار 1996